Mechanizing Complemented Lattices Within Mizar Type System
نویسندگان
چکیده
منابع مشابه
Mizar Formalization of Concept Lattices
In this paper we report on the Mizar codification of formal concepts and concept lattices being part of the theory of formal concept analysis, a mathematical theory that formally describes the notion of concepts and concept hierarchies. We give a short introduction to the theory of concept lattices and describe how we modelled these structures in the Mizar language. After that we discuss experi...
متن کاملBalanced D-lattices Are Complemented *
We characterize d-lattices as those bounded lattices in which every maximal filter/ideal is prime, and we show that a d-lattice is complemented iff it is balanced iff all prime filters/ideals are maximal.
متن کاملκ-Complete Uniquely Complemented Lattices
We show that for any infinite cardinal κ , every complete lattice where each element has at most one complement can be regularly embedded into a uniquely complemented κ-complete lattice. This regular embedding preserves all joins and meets, in particular it preserves the bounds of the original lattice. As a corollary, we obtain that every lattice where each element has at most one complement ca...
متن کاملOn Mechanizing Proofs within a Complete Proof System for Unity
The solution proposed by Sanders in 14] consists of eliminating the need of the substitution axiom from Unity in order to eliminate the unsoundness problem caused by this axiom in Unity without loss of completeness. Sander's solution is based on the strongest invariant concept and provides theoretical advantages by formally capturing the eeects of the initial conditions on the properties of a p...
متن کاملCongruence-preserving Extensions of Finite Lattices to Sectionally Complemented Lattices
In 1962, the authors proved that every finite distributive lattice can be represented as the congruence lattice of a finite sectionally complemented lattice. In 1992, M. Tischendorf verified that every finite lattice has a congruence-preserving extension to an atomistic lattice. In this paper, we bring these two results together. We prove that every finite lattice has a congruence-preserving ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automated Reasoning
سال: 2015
ISSN: 0168-7433,1573-0670
DOI: 10.1007/s10817-015-9333-5